Sender and Recipient Anonymous Communication without Public Key Cryptography
نویسنده
چکیده
We propose a new idea to achive an anonymous communication network which provides both sender and recipient anonymities under the condition that the overall traac may be analyzed. The proposed protocol , which is based on a secret function computation of addition using secret sharing schemes, is estimated with regards to bandwidth and time delay. We show that the bandwidth spend in computation of the proposed protocol is linear to the number of entities, but is limited within a fraction of the total bandwidth.
منابع مشابه
Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity on the sender’s point of view. There is only few work done to ensure anonymity in a cryptographic sense on the recipient’s point of view in group-oriented communications. In this paper, we formalize the notion of grou...
متن کاملPublicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity on the sender’s side. There are merely few works done to ensure anonymity in a cryptographic sense on the recipient’s side in group-oriented communications. This paper formalizes the notion of group decryption (GD). I...
متن کاملDoubly-Anonymous Crowds: Using Secret-Sharing to achieve Sender- and Receiver-Anonymity
Anonymous communication is usually achieved by using overlay networks and public-key cryptography. Besides well-established protocols, based on onion routing, various competing solutions have been proposed in the literature. In this work we extend the Crowds system by providing sender and adjustable receiver anonymity. Our solution is robust against a coalition of passive adversaries having int...
متن کاملThe key exchange cryptosystem used with higher order Diophantine equations
One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can ob...
متن کاملProxy Key Re-encapsulation Mechanism for Group Communications
Many practical applications use hybrid encryption mechanism to deal with large plaintext messages or real-time communication since the performance of the public key encryption scheme is poor. The key encapsulation is a crucial part in hybrid encryption mechanism, which allows a sender to generate a random session key and distribute it to recipient. In this paper we present a proxy key re-encaps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007